#define _CRT_SECURE_NO_WARNINGS 1

#include "Queue.h"

namespace bit
{
	void QueueInit(Queue* pq)
	{
		assert(pq);

		pq->phead = NULL;
		pq->ptail = NULL;
		pq->size = 0;
	}

	void QueueDestroy(Queue* pq)
	{
		assert(pq);

		QNode* cur = pq->phead;

		while (cur)
		{
			QNode* next = cur->next;
			free(cur);
			cur = next;
		}

		pq->phead = pq->ptail = NULL;
		pq->size = 0;
	}

	//入队列
	void QueuePush(Queue* pq, QDataType x)
	{
		assert(pq);

		QNode* newnode = (QNode*)malloc(sizeof(QNode));

		if (NULL == newnode)
		{
			perror("malloc fail");
			return;
		}

		newnode->val = x;
		newnode->next = NULL;

		if (pq->ptail)
		{
			pq->ptail->next = newnode;
			pq->ptail = newnode;
		}
		else
		{
			pq->phead = pq->ptail = newnode;
		}

		pq->size++;
	}

	//出队列
	void QueuePop(Queue* pq)
	{
		assert(pq);

		//0个节点
		//温柔检查
		//if (NULL == pq->phead)
		//{
		//	return;
		//}

		//暴力检查
		assert(pq->phead != NULL);

		//一个节点
		//多个节点
		if (NULL == pq->phead->next)
		{
			free(pq->phead);
			pq->phead = pq->ptail = NULL;
		}
		else
		{
			QNode* next = pq->phead->next;
			free(pq->phead);
			pq->phead = next;
		}

		pq->size--;
	}

	QDataType QueueFront(Queue* pq)
	{
		assert(pq);

		//暴力检查
		assert(pq->phead != NULL);

		return pq->phead->val;
	}

	QDataType QueueBack(Queue* pq)
	{
		assert(pq);

		//暴力检查
		assert(pq->ptail != NULL);

		return pq->ptail->val;
	}

	bool QueueEmpty(Queue* pq)
	{
		assert(pq);

		return 0 == pq->size;
	}

	int QueueSize(Queue* pq)
	{
		assert(pq);

		return pq->size;
	}
}